A Two-Step Matheuristics for Order-Picking Process Problems with One-Directional Material Flow and Buffers

نویسندگان

چکیده

The necessity for undertaking this research is driven by the prevailing challenges encountered in logistic centers. This study addresses a order-picking issue involving unidirectional conveyors and buffers, which are assigned to racks pickers with objective of minimizing makespan. Subsequently, two variations two-step matheuristic approach proposed as solution methodologies. These matheuristics entail decomposing primary problem into subproblems. In initial step, free time pickers/buffers solved, followed an investigation order picking An experimentation phase carried out across three versions distribution center layout, wherein one or more allocated spanning 120 test instances. findings indicate that employing mathematical programming-based technique holds promise yielding solutions within reasonable computational timeframes, particularly when distributing products consumers limited product variety order. Furthermore, offers advantages expediency simplicity, rendering it suitable adoption process designing selecting systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of explicit one-step methods of order two for stiff problems

In this paper we introduce a new class of explicit one-step methods of order 2 that can be used for solving stiff problems. This class constitutes a generalization of the two-stage explicit Runge-Kutta methods, with the property of having an A-stability region that varies during the integration in accordance with the accuracy requirements. Some numerical experiments on classical stiff problems ...

متن کامل

Optimizing a dynamic order-picking process

This research studies the problem of batching orders in a dynamic, finite-horizon environment to minimize order tardiness and overtime costs of the pickers. The problem introduces the following trade-off: at every period, the picker has to decide whether to go on a tour and pick the accumulated orders, or to wait for more orders to arrive. By waiting, the picker risks higher tardiness of existi...

متن کامل

A survey on matheuristics for routing problems

In this paper we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of the matheuristics: decomposition approaches, im...

متن کامل

Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems

In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the n...

متن کامل

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app131810099